de Systèmes pour l ’ Aide à la Décision UMR 7243 201 M CAHIER DU 3 7
نویسنده
چکیده
The validity of majority rule in an election with but two candidates— and so also of Condorcet consistency—is challenged. Axioms based on evaluating candidates—paralleling those of K. O. May characterizing majority rule for two candidates based on comparing candidates—lead to another method, majority judgment, that is unique in agreeing with the majority rule on pairs of “polarized” candidates. It is a practical method that accommodates any number of candidates, avoids both the Condorcet and Arrow paradoxes, and best resists strategic manipulation. It may also be viewed as a “solution” to Dahl’s (reformulated) intensity problem in that an intense minority sometimes defeats an apathetic majority.
منابع مشابه
Modélisation de Systèmes pour d ’ Aide à la Décision UMR 7243 Juin 201 4 Preferences in Artificial Intelligence
متن کامل
Laboratoire d ’ Analyse et Modélisation de Systèmes pour d ’ Aide à la Décision UMR 7243 Juin 201 4 Preferences in Artificial
متن کامل
Laboratoire d ’ Analyse et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 201 5 On social rankings and their properties
Several real-life complex systems, like human societies or economic networks, are formed by interacting units characterized by patterns of relationships that may generate a group-based social hierarchy. In this paper, we address the problem of how to rank the individuals with respect to their ability to “influence” the relative strength of groups in a society. We also analyse the effect of basi...
متن کاملLaboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Décembre 2012 A note on Using T - joins to Approximate Solutions for CAHIER DU 32 9
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017